A Generator of Boolean Acceptors
نویسنده
چکیده
Reactive systems are real-time systems which continuously react to their environment. The Synchronie environment integrates several synchronous languages to design such systems as well as several formalisms and tools to verify their properties. The integration is based on Boolean Automata, BA for short. This paper presents how safety properties speciied in a linear Temporal Logic are automatically veriied in Synchronie. Roughly, a safety property is compiled into a BA which works as an acceptor for the computations of the synchronous program. The veriication is done using the actual programs compiled into BA and not a separate model. Since a safety formula is translated into a BA, a particular automaton, our algorithm is independent of any programming language and may be used widely, especially for systems with discrete time.
منابع مشابه
Hardware Stream Cipher Based on LFSR and Modular Division Circuit
Feedback Shift Registers (LFSR) is presented here. In this method, shift register structure used for polynomial modular division is combined with LFSR keystream generator to yield a new keystream generator with much higher periodicity. Security is brought into this structure by using the Boolean function to combine state bits of the LFSR keystream generator and taking the output through the Boo...
متن کاملYet Another Pseudorandom Number Generator
We propose a novel pseudorandom number generator based on Rössler attractor and bent Boolean function. We estimated the output bits properties by number of statistical tests. The results of the cryptanalysis show that the new pseudorandom number generation scheme provides a high level of data security. Keywords—Rössler attractor, bent Boolean function, pseudorandom number generator.
متن کاملP=BPP Unless E has Subexponential Circuits: Derandomizing the XOR Lemma
Yao showed that the $XOR$ of independent random instances of a somewhat hard Boolean problem becomes almost completely unpredictable. In this paper we show that, in non-uniform settings, total independence is not necessary for this result to hold. We give a pseudo-random generator which produces $n$ instances of a problem for which the analog of the $XOR$ lemma holds. Combining this generator w...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملPseudorandom Generators for Low Sensitivity Functions
A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...
متن کامل